Search results for "Markov chain [Monte Carlo]"

European Option Pricing and Hedging with Both Fixed and Proportional Transaction Costs

2003

Abstract In this paper we provide a systematic treatment of the utility based option pricing and hedging approach in markets with both fixed and proportional transaction costs: we extend the framework developed by Davis et al. (SIAM J. Control Optim., 31 (1993) 470) and formulate the option pricing and hedging problem. We propose and implement a numerical procedure for computing option prices and corresponding optimal hedging strategies. We present a careful analysis of the optimal hedging strategy and elaborate on important differences between the exact hedging strategy and the asymptotic hedging strategy of Whalley and Wilmott (RISK 7 (1994) 82). We provide a simulation analysis in order …

A Dominance Variant Under the Multi-Unidimensional Pairwise-Preference Framework: Model Formulation and Markov Chain Monte Carlo Estimation.

2018

Forced-choice questionnaires have been proposed as a way to control some response biases associated with traditional questionnaire formats (e.g., Likert-type scales). Whereas classical scoring methods have issues of ipsativity, item response theory (IRT) methods have been claimed to accurately account for the latent trait structure of these instruments. In this article, the authors propose the multi-unidimensional pairwise preference two-parameter logistic (MUPP-2PL) model, a variant within Stark, Chernyshenko, and Drasgow’s MUPP framework for items that are assumed to fit a dominance model. They also introduce a Markov Chain Monte Carlo (MCMC) procedure for estimating the model’s paramete…

A probabilistic expert system for predicting the risk of Legionella in evaporative installations

2011

Research highlights? The bacterium Legionella usually lives in water sources such as cooling towers. ? We discuss a probabilistic expert system for predicting the risk of Legionella. ? The expert system has a master-slave architecture. ? The inference engine is implemented through Bayesian reasoning. ? Bayesian networks model and connect relationships for chemical and physical variables. Early detection in water evaporative installations is one of the keys to fighting against the bacterium Legionella, the main cause of Legionnaire's disease. This paper discusses the general structure, elements and operation of a probabilistic expert system capable of predicting the risk of Legionella in rea…

Statistics of transitions for Markov chains with periodic forcing

2013

The influence of a time-periodic forcing on stochastic processes can essentially be emphasized in the large time behaviour of their paths. The statistics of transition in a simple Markov chain model permits to quantify this influence. In particular the first Floquet multiplier of the associated generating function can be explicitly computed and related to the equilibrium probability measure of an associated process in higher dimension. An application to the stochastic resonance is presented.

Cluster priors in the Bayesian modelling of fMRI data

2001

Bayesian reanalysis of a quantitative trait locus accounting for multiple environments by scaling in broilers1

2006

A Bayesian method was developed to handle QTL analyses of multiple experimental data of outbred populations with heterogeneity of variance between sexes for all random effects. The method employed a scaled reduced animal model with random polygenic and QTL allelic effects. A parsimonious model specification was applied by choosing assumptions regarding the covariance structure to limit the number of parameters to estimate. Markov chain Monte Carlo algorithms were applied to obtain marginal posterior densities. Simulation demonstrated that joint analysis of multiple environments is more powerful than separate single trait analyses of each environment. Measurements on broiler BW obtained from…

Can the adaptive Metropolis algorithm collapse without the covariance lower bound?

2011

The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …